The problem of new uses.
نویسنده
چکیده
منابع مشابه
A new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP problem
Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...
متن کاملA New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem
The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...
متن کاملA new heuristic approach to solve product mix problems in a multi-bottleneck system
Product mix problem (PMP) is one of the most important and complicated problems in production systems. Different approaches have been applied to solve this problem, among them, theory of constraints (TOC) has been widely considered since 1990s. This paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. At first, t...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملAddressing the Freight Consolidation and Containerization Problem by Recent and Hybridized Meta-heuristic Algorithms
Nowadays, in global free market, third-party logistics providers (3PLs) are becoming increasingly important. Hence, this study aims to develop the freight consolidation and containerization problem, which consists of loading items into containers and then shipping these containers to different warehouse they are delivered to their final destinations. In order to handle the proposed problem, thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Yale journal of health policy, law, and ethics
دوره 5 2 شماره
صفحات -
تاریخ انتشار 2005